Independence Complexes of Cylinders Constructed from Square and Hexagonal Grid Graphs

نویسنده

  • Johan Thapper
چکیده

In the paper [Fendley et al., J. Phys. A: Math. Gen., 38 (2005), pp. 315-322], Fendley, Schoutens and van Eerten studied the hard square model at negative activity. They found analytical and numerical evidence that the eigenvalues of the transfer matrix with periodic boundary were all roots of unity. They also conjectured that for an m × n square grid, with doubly periodic boundary, the partition function is equal to 1 when m and n are relatively prime. These conjectures were proven in [Jonsson, Electronic J. Combin., 13(1) (2006), R67]. There, it was also noted that the cylindrical case seemed to have interesting properties when the circumference of the cylinder is odd. In particular, when 3 is a divisor of both the circumference and the width of the cylinder minus 1, the partition function is -2. Otherwise, it is equal to 1. In this paper, we investigate the hard square and hard hexagon models at activity -1, with single periodic boundary, i.e, cylindrical identifications, using both topological and combinatorial techniques. We compute the homology groups of the associated independence complex for small sizes and suggest a matching which, we believe, with further analysis could help solve the conjecture. We also briefly review a technique recently described by Bousquet-Mélou, Linusson and Nevo, for determining some of the eigenvalues of the transfer matrix of the hard square model with cylindrical identification using a related, but more easily analysed model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs

In 2007, Arkin et al. [3] initiated a systematic study of the complexity of the Hamiltonian cycle problem on square, triangular, or hexagonal grid graphs, restricted to polygonal, thin, superthin, degree-bounded, or solid grid graphs. They solved many combinations of these problems, proving them either polynomially solvable or NP-complete, but left three combinations open. In this paper, we pro...

متن کامل

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Certain Homology Cycles of the Independence Complex of Grid Graphs

Let G be an infinite graph such that the automorphism group of G contains a subgroup K ∼= Z with the property that G/K is finite. We examine the homology of the independence complex Σ(G/I) of G/I for subgroups I of K of full rank, focusing on the case that G is the square, triangular, or hexagonal grid. Specifically, we look for a certain kind of homology cycles that we refer to as “cross-cycle...

متن کامل

On Touching Triangle Graphs

In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. The class of graphs with touching triangle representations is not closed under minors, making characterization difficult. We do show that pairs of vert...

متن کامل

Hamilton Circuits in Hexagonal Grid Graphs

We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid points of a regular hexagonal tiling of the plane and edges corresponding to hexagon sides. We show that Hamilton circuit in hexagonal grid graphs is NP-complete.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008